Generalized Lucas cubes

نویسنده

  • Aleksandar Ilić
چکیده

Let f be a binary string and d C 1. Then the generalized Lucas cube Qd(JÐf ) is introduced as the graph obtained from the d-cube Qd by removing all vertices that have a circulation containing f as a substring. The question for which f and d, the generalized Lucas cube Qd(JÐf ) is an isometric subgraph of the d-cube Qd is solved for all binary strings of length at most five. Several isometrically embeddable and non-embeddable infinite series where f is of arbitrary length are given. Some structural properties of generalized Lucas cubes are also presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes

If f is a binary word and d a positive integer, then the generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all the vertices that contain f as a factor, while the generalized Lucas cube Qd( ↽Ð f ) is the graph obtained from Qd by removing all the vertices that have a circulation containing f as a factor. The Fibonacci cube Γd and the Lucas cube Λd are the grap...

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

Congestion-free routing of linear permutations on Fibonacci and Lucas cubes

In recent years there has been much interest in certain subcubes of hypercubes, namely Fibonacci cubes and Lucas cubes (and their generalized versions). In this article we consider off-line routing of linear permutations on these cubes. The model of routing we use regards edges as bi-directional, and we do not allow queues of length greater than one. Messages start out at different vertices, an...

متن کامل

On the Wiener index of generalized Fibonacci cubes and Lucas cubes

The generalized Fibonacci cube Qd(f) is the graph obtained from the d-cube Qd by removing all vertices that contain a given binary word f as a factor; the generalized Lucas cube Qd( ↽Ð f ) is obtained from Qd by removing all the vertices that have a circulation containing f as a factor. In this paper the Wiener index of Qd(1) and the Wiener index of Qd( ↽Ð 1) are expressed as functions of the o...

متن کامل

Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials

In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009